const github.com/andybalholm/brotli.huffmanTableBits

17 uses

	github.com/andybalholm/brotli (current package)
		decode.go#L53: const huffmanTableBits = 8
		decode.go#L333: 	if table[0].bits > huffmanTableBits {
		decode.go#L334: 		var nbits uint32 = uint32(table[0].bits) - huffmanTableBits
		decode.go#L335: 		dropBits(br, huffmanTableBits)
		decode.go#L336: 		table = table[uint32(table[0].value)+((bits>>huffmanTableBits)&bitMask(nbits)):]
		decode.go#L365: 	if table[0].bits <= huffmanTableBits {
		decode.go#L375: 	if available_bits <= huffmanTableBits {
		decode.go#L380: 	val = (val & bitMask(uint32(table[0].bits))) >> huffmanTableBits
		decode.go#L382: 	available_bits -= huffmanTableBits
		decode.go#L388: 	dropBits(br, huffmanTableBits+uint32(table[0].bits))
		decode.go#L409: 	table = table[getBits(br, huffmanTableBits):]
		decode.go#L419: 	if *bits > huffmanTableBits {
		decode.go#L422: 		var mask uint32 = bitMask((*bits - huffmanTableBits))
		decode.go#L423: 		dropBits(br, huffmanTableBits)
		decode.go#L424: 		ext = ext[(val>>huffmanTableBits)&mask:]
		decode.go#L779: 			table_size = buildSimpleHuffmanTable(table, huffmanTableBits, s.symbols_lists_array[:], s.symbol)
		decode.go#L830: 			table_size = buildHuffmanTable(table, huffmanTableBits, s.symbol_lists, s.code_length_histo[:])